On the Syntactic Transformation Semigroup of a Language Generated by a Finite Biprefix Code
نویسنده
چکیده
Let P be a finite biprefix code and let >t: = (9, S) be the syntactic transformation semigroup fts:r of P’. We show that if e ES is an idenpotent, then the ts X, = (Qe, eSe) CORS~~+S of partial one to one maps. We also show that any ts of partial one to one maps divides a ts ci partial one fto one maps which is the syntactic ts of a finite biprefix code.
منابع مشابه
The Syntactic Monoid of the Semigroup Generated by a Maximal Prefix Code
In this paper we investigate the semigroup structure of the syntactic monoid Syn(C+) of C+, the semigroup generated by a maximal prefix code C for which C+ is a single class of the syntactic congruence. In particular we prove that for such a prefix code C, either Syn(C+) is a group or it is isomorphic to a special type of submonoid of G× T (R) where G is a group and T (R) is the full transforma...
متن کاملSemisimplicity of the Algebra Associated to a Biprefix Code
{. INTRODUCTION There exists a canonical way to associate to each language (that is, to each subset of a free monoid) an algebra on a ~iven field; we call it its syntactic algebra. This construction is in fact a particular case of a more general one that applies to formal power series in non commutative variables similar to the construction of the syntactic monoid of a language. In this paper w...
متن کاملLarge Aperiodic Semigroups
The syntactic complexity of a regular language is the size of its syntactic semigroup. This semigroup is isomorphic to the transition semigroup of the minimal deterministic finite automaton accepting the language, that is, to the semigroup generated by transformations induced by non-empty words on the set of states of the automaton. In this paper we search for the largest syntactic semigroup of...
متن کاملOn Deterministic Finite Automata and Syntactic Monoid Size, Continued
We continue our investigation on the relationship between regular languages and syntactic monoid size. In this paper we confirm the conjecture on two generator transformation semigroups. We show that for every prime n ≥ 7 there exist natural numbers k and ` with n = k + ` such that the semigroup Uk,` is maximal w.r.t. its size among all (transformation) semigroups which can be generated with tw...
متن کاملOn the Syntactic Monoids Associated with a Class of Synchronized Codes
A complete code C over an alphabet A is called synchronized if there exist x, y ∈ C* such that xA*∩A*y⊆C*. In this paper we describe the syntactic monoid Syn(C (+)) of C (+) for a complete synchronized code C over A such that C (+), the semigroup generated by C, is a single class of its syntactic congruence P C (+) . In particular, we prove that, for such a code C, either C = A or Syn(C (+)) is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 21 شماره
صفحات -
تاریخ انتشار 1982